Technical Report Improvement of Fitch function for Maximum Parsimony in Phylogenetic Reconstruction with Intel AVX2 assembler instructions
ثبت نشده
چکیده
The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been devoted by the Computer Science community to solve this NP-complete problem and many techniques have been used or designed in order to decrease the computation time necessary to obtain an acceptable solution. In this paper we report an improvement of the evaluation of the Fitch function for Maximum Parsimony using AVX2 assembler instruction of Intel processors.
منابع مشابه
Implementing BLAKE with AVX, AVX2, and XOP
In 2013 Intel will release the AVX2 instructions, which introduce 256-bit singleinstruction multiple-data (SIMD) integer arithmetic. This will enable desktop and server processors from this vendor to support 4-way SIMD computation of 64-bit add-rotate-xor algorithms, as well as 8-way 32-bit SIMD computations. AVX2 also includes interesting instructions for cryptographic functions, like any-to-a...
متن کاملAngers Cedex 01 Technical Report : Three new techniques to improve phylogenetic reconstruction with Maximum Parsimony Research
The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been devoted by the Computer Science community to solve this NP-complete problem and many techniques have been used or designed in order to decrease the computation time necessary to obtain an acceptable solution. In this ...
متن کاملPTC: An Interactive Tool for Phylogenetic Tree Construction
A phylogenetic tree represents the evolutionary history of a group of organisms. In this work, we introduce a novel interactive tool for constructing phylogenetic trees, Phylogenetic Tree Construction package. The package supports four well-known algorithms, Unweighted Pair Group Method using Arithmetic average, Neighbor Joining, Fitch Margoliash, and Maximum Parsimony.
متن کاملFast character optimization in parsimony phylogeny reconstruction
The problem of finding a phylogeny with maximum parsimony is one of the main problems in computational biology. While it is impossible to search the possible tree space exhaustively for large data sets, most heuristic approaches try to search in the neighborhood of sub-optimal trees. The speed of computing a score for each tree (e.g. tree length or total number of character changes) is as impor...
متن کاملRelative Efficiencies of the Fitch-Margoliash, Maximum- Parsimony, Maximum-Likelihood, Minimum-Evolution, and Neighbor-joining Methods of Phylogenetic Tree Construction in Obtaining the Correct Tree’
The relative efficiencies of several tree-making methods for obtaining the correct phylogenetic tree were studied by using computer simulation. The methods examined were the Fitch-Margoliash (FM), maximum-parsimony (MP), maximumlikelihood (ML), minimum-evolution (ME), and neighbor-joining (NJ) methods. We simulated the evolutionary changes of six DNA sequences each with a length of either 300 o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013